package com.example.leetcode;

import java.util.HashMap;
import java.util.Map;

/**
 * 两数之和
 *
 * 集合指针模型
 */
public class Demo0001 {

    public static void main(String[] args) {

    }

    public static int[] twoSum(int[] nums, int target) {
        Map<Integer, Integer> map =new HashMap<>();

        for (int i = 0; i < nums.length; i++) {
            if (map.containsKey(target-nums[i])){
                return new int[]{map.get(target-nums[i]),i};
            }
            map.put(nums[i],i);
        }

        return new int[0];
    }
}
